On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint two
نویسندگان
چکیده
منابع مشابه
The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two
We consider a bipartite distance-regular graph Γ with diameter D ≥ 4, valency k ≥ 3, intersection numbers bi, ci, distance matrices Ai, and eigenvalues θ0 > θ1 > · · · > θD. Let X denote the vertex set of Γ and fix x ∈ X. Let T = T (x) denote the subalgebra of MatX(C) generated by A,E ∗ 0 , E ∗ 1 , . . . , E ∗ D, where A = A1 and E ∗ i denotes the projection onto the i th subconstituent of Γ wi...
متن کاملSmall graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملTwo distance-regular graphs
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B3(q) induced on the vertices far from a fixed point, and the subgraph of the dual polar graph of type D4(q) induced on the vertices far from a fixed edge. The latter is the extended bipartite double of the former.
متن کاملOn Distance-Regular Graphs with Height Two, II
Let Γ be a distance-regular graph with diameterd ≥ 3 and heighth = 2, whereh = max{i : pd,i 6= 0}. Suppose that for every α in Γ and every β in Γd(α), the induced subgraph on Γd(α)∩ Γ2(β) is isomorphic to a complete multipartite graph Kt×2 with t ≥ 2. Then d = 4 and Γ is isomorphic to the Johnson graph J(10, 4).
متن کاملTwo spectral characterizations of regular, bipartite graphs with five eigenvalues
Graphs with a few distinct eigenvalues usually possess an interesting combinatorial structure. We show that regular, bipartite graphs with at most six distinct eigenvalues have the property that each vertex belongs to the constant number of quadrangles. This enables to determine, from the spectrum alone, the feasible families of numbers of common neighbors for each vertex with other vertices in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2017
ISSN: 0024-3795
DOI: 10.1016/j.laa.2016.11.021